Graph Based GP Applied to Dynamical Systems Modeling
نویسندگان
چکیده
Model construction is usually guided by a trial-error process, where each iteration is divided into two steps: (i) collect or refine the set of equations that direct the system behaviour, normally in differential form, solving them using, most of the time, the S transform, and (ii) fit a set of properties (parameters) in the model obtained using observations taken from the real system. There have been many attempts to automate this process. We will extend an approach based on a search of a model of the system in a block diagram representation, where the trial-error process is solved with Genetic Programming. Some modifications over this approach are made to allow a more general family of models and to enhance its efficiency.
منابع مشابه
ENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملThe Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach
In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...
متن کاملMeta-Evolution in Graph GP
In this contribution we investigate the evolution of operators for Genetic Programming by means of Genetic Programming. Metaevolution of recombination operators in graph-based GP is applied and compared to other methods for the variation of recombination operators in graph-based GP. We demonstrate that a straightforward application of recombination operators onto themselves does not work well. ...
متن کاملRELATIVE INFORMATION FUNCTIONAL OF RELATIVE DYNAMICAL SYSTEMS
In this paper by use of mathematical modeling of an observer [14,15] the notion of relative information functional for relative dynamical systemson compact metric spaces is presented. We extract the information function ofan ergodic dynamical system (X,T) from the relative information of T fromthe view point of observer χX, where X denotes the base space of the system.We also generalize the in...
متن کاملSynchronization criteria for T-S fuzzy singular complex dynamical networks with Markovian jumping parameters and mixed time-varying delays using pinning control
In this paper, we are discuss about the issue of synchronization for singular complex dynamical networks with Markovian jumping parameters and additive time-varying delays through pinning control by Takagi-Sugeno (T-S) fuzzy theory.The complex dynamical systems consist of m nodes and the systems switch from one mode to another, a Markovian chain with glorious transition probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001